Polar-Natural Distance and Curve Reconstruction

A distance-based parameter free algorithm for curve reconstruction

In this paper, a simple, efficient, and parameter free algorithm, DISCUR, is proposed to reconstruct curves from unorganized sample points. The proposed algorithm can reconstruct multiple simple curves that may be open, closed, and/or with sharp corners. The criteria for the curve reconstruction are based on two observations we have made concerning the human visual system: (1) two closest neigh...

Curve Reconstruction via the Global Statistics of Natural Curves

Reconstructing the missing parts of a curve has been the subject of much computational research, with applications in image inpainting, object synthesis, etc.. Different approaches for solving that problem are typically based on processes that seek visually pleasing or perceptually plausible completions. In this work we focus on reconstructing the underlying physically likely shape by utilizing...

Curve Reconstruction

Contour-Based Surface Reconstruction using Implicit Curve Fitting, and Distance Field Filtering and Interpolation

This paper presents a volumetric approach to reconstructing a smooth surface from a sparse set of parallel binary contours, e.g. those produced via histologic imaging. It creates a volume dataset by interpolating 2D filtered distance fields. The zero isosurface embedded in the computed volume provides the desired result. MPU implicit functions are fit to the input contours, defined as binary im...

36 Curve and Surface Reconstruction

The problem of reconstructing a shape from its sample appears in many scientific and engineering applications. Because of the variety in shapes and applications, many algorithms have been proposed over the last three decades, some of which exploit application-specific information and some of which are more general. We focus on techniques that apply to the general setting and have geometric and ...